Genetic Algorithm Approach to a Multiobjective Rescheduling Problem in a Job Shop
نویسندگان
چکیده
منابع مشابه
A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem
This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...
متن کاملGenetic Algorithm Approach to Multiobjective Rescheduling on Parallel Machines
This paper deals with multiobjective rescheduling on parallel machines for alteration of due date. The objectives of this rescheduling problem are to minimize both the total tardiness and a difference of schedule from that before the alteration. Genetic algorithms with various individual descriptions are applied to the problem in order to find the Pareto optimal solutions. In particular, two de...
متن کاملA Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem
The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Fo...
متن کاملA Promising Genetic Algorithm Approach to Job - Shop
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is a variant of one known to work moderate...
متن کاملMultiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem
Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2004
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.40.938